On the Computability and Complexity Issues of Extended RDF
نویسندگان
چکیده
ERDF stable model semantics is a recently proposed semantics for ERDF ontologies and a faithful extension of RDFS semantics on RDF graphs. In this paper, we elaborate on the computability and complexity issues of the ERDF stable model semantics. We show that decidability under this semantics cannot be achieved, unless ERDF ontologies of restricted syntax are considered. Therefore, we propose a slightly modified semantics for ERDF ontologies, called ERDF #n-stable model semantics. We show that entailment under this semantics is in general decidable and it also extends RDFS entailment. An equivalence statement between the two semantics and various complexity results are provided.
منابع مشابه
Computability and Complexity Issues of Extended RDF
ERDF stable model semantics is a recently proposed semantics for ERDF ontologies and a faithful extension of RDFS semantics on RDF graphs. Unfortunately, ERDF stable model semantics is in general undecidable. In this paper, we elaborate on the computability and complexity issues of the ERDF stable model semantics.
متن کاملEvaluating of Refuse Derived Fuel (RDF) Production from Municipal Solid Waste (Case Study: Qazvin Province)
Considering increasing population growth in recent decades, and consequently, the increase in waste production in the world, waste management and efforts to reduce their harm to the environment has become an important issue. One of the appropriate ways to manage municipal waste is to generate energy from waste, especially by RDF production method. On the other hand, in order to reduce the consu...
متن کاملIMPLEMENTATION OF EXTENDED KALMAN FILTER TO REDUCE NON CYCLO-STATIONARY NOISE IN AERIAL GAMMA RAY SURVEY
Gamma-ray detection has an important role in the enhancement the nuclear safety and provides a proper environment for applications of nuclear radiation. To reduce the risk of exposure, aerial gamma survey is commonly used as an advantage of the distance between the detection system and the radiation sources. One of the most important issues in aerial gamma survey is the detection noise. Various...
متن کاملAlgorithmic randomness and measures of complexity
We survey recent advances on the interface between computability theory and algorithmic randomness, with special attention on measures of relative complexity. We focus on (weak) reducibilities that measure (a) the initial segment complexity of reals and (b) the power of reals to compress strings, when they are used as oracles. The results are put into context and several connections are made wi...
متن کاملOn the outer independent 2-rainbow domination number of Cartesian products of paths and cycles
Let G be a graph. A 2-rainbow dominating function (or 2-RDF) of G is a function f from V(G) to the set of all subsets of the set {1,2} such that for a vertex v ∈ V (G) with f(v) = ∅, thecondition $bigcup_{uin N_{G}(v)}f(u)={1,2}$ is fulfilled, wher NG(v) is the open neighborhoodof v. The weight of 2-RDF f of G is the value$omega (f):=sum _{vin V(G)}|f(v)|$. The 2-rainbowd...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008